Demand allocation with latency cost functions
نویسندگان
چکیده
منابع مشابه
Demand allocation with latency cost functions
We address the exact resolution of a MINLP model where resources can be activated in order to satisfy a demand (a partitioning constraint) while minimizing total cost. Cost functions are convex latency functions plus a fixed activation cost. A branch and bound algorithm is devised, featuring three important characteristics. First, the lower bound (therefore each subproblem) can be computed in O...
متن کاملResource Allocation Problems with Cost Functions
We study the complexity of a multilateral negotiation framework in which autonomous agents agree in pairs to exchange resources in order to minimise their individual cost. We are interested in establishing whether an allocation of resources that minimises total cost can be reached from an initial allocation in which one agent holds all the resources and one resource is transferred in each contr...
متن کاملHierarchical NFV Datacenters : Resource Allocation with Cost - Latency Tradeoff
Network Function Virtualization (NFV) allows datacenters to consolidate network appliance functions onto commodity servers and devices. Currently telecommunication carriers are re-architecting their central offices as NFV datacenters that, along with Software-Defined Networking (SDN), help network service providers to speed deployment and reduce cost. However, it is still unclear how a carrier ...
متن کاملInventory Models with Power Demand and Inventory-Induced Demand with Holding Cost Functions
Corresponding Author: Rakesh Prakash Tripathi Department of Mathematics Graphic Era University, Dehradun, India Email: [email protected] Abstract: In real life customers are motivated to buy more if there is more availability of product. In this study, we develop inventory model for inventory dependent demand with different holding cost function. Mathematical formulations are discu...
متن کاملRobust uncapacitated multiple allocation hub location problem under demand uncertainty: minimization of cost deviations
The hub location–allocation problem under uncertainty is a real-world task arising in the areas such as public and freight transportation and telecommunication systems. In many applications, the demand is considered as inexact because of the forecasting inaccuracies or human’s unpredictability. This study addresses the robust uncapacitated multiple allocation hub location problem with a set of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2010
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-010-0398-y